A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
نویسندگان
چکیده
A new iterative method for finding the projection onto the intersection of two closed convex sets in a Hilbert space is presented. It is a Haugazeau-like modification of a recently proposed averaged alternating reflections method which produces a strongly convergent sequence.
منابع مشابه
Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
We present a parallel iterative method to find the shortest distance projection of a given point onto the intersection of a finite number of closed convex sets in a real Hilbert space. In the method use is made of weights and a relaxation coefficient which may vary at each iteration step, and which are determined at each step by geometrical conditions. Math. Subj. Class: 46010; 65JXX; 90030; 49...
متن کاملNorm Convergence of Realistic Projection and Reflection Methods
The (2-set) convex feasibility problem asks for a point contained within the intersection of two closed convex sets of a Hilbert space. Projection and reflection methods represent a class of algorithmic schemes which are commonly used to solve this problem. Some notable projection and reflection methods include the method of alternating projections, the Douglas–Rachford method, the cyclic Dougl...
متن کاملFinding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
We study the convergence of an iterative projection/reflection algorithm originally proposed for solving what are known as phase retrieval problems in optics. There are two features that frustrate any analysis of iterative methods for solving the phase retrieval problem: nonconvexity and infeasibility. The algorithm that we developed, called Relaxed Averaged Alternating Reflections (RAAR), was ...
متن کاملExtensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems∗
The convex feasibility problem (CFP) is to find a member of the intersection of finitely many closed convex sets in Euclidean space. When the intersection is empty, one can minimize a proximity function to obtain an approximate solution to the problem. The split feasibility problem (SFP) and the split equality problem (SEP) are generalizations of the CFP. The approximate SFP (ASFP) and approxim...
متن کاملConvex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Approximation Theory
دوره 141 شماره
صفحات -
تاریخ انتشار 2006